Multi-Scale Kernels Using Random Walks
نویسندگان
چکیده
We introduce novel multiscale kernels using the random walk framework and derive corresponding embeddings and pairwise distances. The fractional moments of the rate of continuous time random walk (equivalently diffusion rate) are used to discover higher order kernels (or similarities) between pair of points. The formulated kernels are isometry, scale, and tessellation invariant, can be made globally or locally shape aware, and are insensitive to partial objects and noise based on the moment and influence parameters. Additionally, the corresponding kernel distances and embeddings are convergent and efficiently computable. We introduce dual GMS signatures based on the kernels and discuss the applicability of the multiscale distance and embedding. Collectively, we present a unified view of popular embeddings and distance metrics while recovering intuitive probabilistic interpretations on discrete surface meshes.
منابع مشابه
Halting in Random Walk Kernels
Random walk kernels measure graph similarity by counting matching walks in two graphs. In their most popular form of geometric random walk kernels, longer walks of length k are downweighted by a factor of λ (λ < 1) to ensure convergence of the corresponding geometric series. We know from the field of link prediction that this downweighting often leads to a phenomenon referred to as halting: Lon...
متن کاملLower estimates for random walks on a class of amenable p-adic groups
We give central lower estimates for the transition kernels corresponding to symmetric random walks on certain amenable p-adic groups.
متن کاملSearching Remote Homology with Spectral Clustering with Symmetry in Neighborhood Cluster Kernels
UNLABELLED Remote homology detection among proteins utilizing only the unlabelled sequences is a central problem in comparative genomics. The existing cluster kernel methods based on neighborhoods and profiles and the Markov clustering algorithms are currently the most popular methods for protein family recognition. The deviation from random walks with inflation or dependency on hard threshold ...
متن کاملDynamics for the Brownian Web and the Erosion Flow
Abstract. The Brownian web is a random object that occurs as the scaling limit of an infinite system of coalescing random walks. Perturbing this system of random walks by, independently at each point in space-time, resampling the random walk increments, leads to some natural dynamics. In this paper we consider the corresponding dynamics for the Brownian web. In particular, pairs of coupled Brow...
متن کاملCoinciding Walk Kernels: Parallel Absorbing Random Walks for Learning with Graphs and Few Labels
Exploiting autocorrelation for node-label prediction in networked data has led to great success. However, when dealing with sparsely labeled networks, common in present-day tasks, the autocorrelation assumption is difficult to exploit. Taking a step beyond, we propose the coinciding walk kernel (cwk), a novel kernel leveraging label-structure similarity – the idea that nodes with similarly arra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 33 شماره
صفحات -
تاریخ انتشار 2014